K maximum probability attack paths dynamic generation algorithm

K maximum probability attack paths dynamic generation algorithm

An attack graph depicts multiple-step attack and provides a description of system security vulnerabilities. It illustrates critical information necessary to identify potential weaknesses and areas for enhanced defense. Attack graphs include multiple attack paths, which are a focus for further detailed analysis and risk mitigation. Considering that different vulnerabilities have different probab...

Maximum Edge-Disjoint Paths in k-Sums of Graphs

We consider the approximability of the maximum edge-disjoint paths problem (MEDP) in undirected graphs, and in particular, the integrality gap of the natural multicommodity flow based relaxation for it. The integrality gap is known to be Ω( √ n) even for planar graphs [14] due to a simple topological obstruction and a major focus, following earlier work [17], has been understanding the gap if s...

Algorithm for K Disjoint Maximum Subarrays

The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it. For K disjoint maximum subarrays, Ruzzo and Tompa gave an O(n) time solution for one-dimension. This solution is, however, difficult to extend to twodimensions. While a trivial solution of O(Kn) time is easily obtainable for two-dimensions, little study has been undertaken to better this. W...

Determination of Maximum Bayesian Entropy Probability Distribution

In this paper, we consider the determination methods of maximum entropy multivariate distributions with given prior under the constraints, that the marginal distributions or the marginals and covariance matrix are prescribed. Next, some numerical solutions are considered for the cases of unavailable closed form of solutions. Finally, these methods are illustrated via some numerical examples.

An Approximation Algorithm for Maximum Packing of 3-Edge Paths